Curriculum-based course timetabling with SAT and MaxSAT
نویسندگان
چکیده
This paper describes our work on applying novel techniques based on propositional satisfiability (SAT) solvers and optimizers to the Curriculum-based Course Timetabling problem. Out of 32 standard benchmark instances derived from the Second International Timetabling Competition held in 2007, our techniques yield the best known solutions for 21 of them (19 of them being optimal), improving the previously best known solutions for 9. In addition, we obtain 18 new lower bounds for this benchmark set by applying a new full (Weighted) Partial MaxSAT approach of the Curriculum-based Course Timetabling problem.
منابع مشابه
Solving the Course-timetabling Problem of Cairo University Using Max-SAT
Due to the good performance of current SAT (satisfiability) and MaxSAT (maximum satisfiability) solvers, many real-life optimization problems such as scheduling can be solved by encoding them into Max-SAT. In this paper we tackle the course timetabling problem of the department of mathematics, Cairo University by encoding it into Max-SAT. Generating timetables for the department by hand has pro...
متن کاملSAT Model for the Curriculum-Based Course Timetabling Problem
Two widely used problems are the Satisfiability problem (SAT) and the Curriculum-Based Course Timetabling (CB-CTT) problem. The SAT problem searches for an assignment that make true a certain boolean formula. On the other side, the CB-CTT involves the task of scheduling lectures of courses to rooms, considering teacher availability, a specified curricula, and a set of constraints. Given the adv...
متن کاملReal-life Curriculum-based Timetabling
This paper presents an innovative approach to curriculum-based timetabling. Curricula are defined by a rich model that includes optional courses and course groups among which students are expected to take a subset of courses. Transformation of the curriculum model into the enrollment model is proposed and a local search algorithm generating corresponding enrollments is introduced. This enables ...
متن کاملModeling High School Timetabling as Partial Weighted maxSAT
High School Timetabling (HSTT) is a well known and wide spread problem. The problem consists of coordinating resources (e.g. teachers, rooms), time slots, and events (e.g. lectures) with respect to various constraints. Unfortunately, HSTT is hard to solve and just finding a feasible solution for simple variants of HSTT has been proven to be NP-complete. In addition, timetabling requirements var...
متن کاملThe Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annals OR
دوره 218 شماره
صفحات -
تاریخ انتشار 2014